Planning for Loosely Coupled Agents Using Partial Order Forward-Chaining
نویسنده
چکیده
We investigate a hybrid between temporal partial-order and forward-chaining planning where each action in a partially ordered plan is associated with a partially defined state. The focus is on centralized planning for multi-agent domains and on loose commitment to the precedence between actions belonging to distinct agents, leading to execution schedules that are flexible where it matters the most. Each agent, on the other hand, has a sequential thread of execution reminiscent of forward-chaining. This results in strong and informative agent-specific partial states that can be used for partial evaluation of preconditions as well as precondition control formulas used as guidance. Empirical evaluation shows the resulting planner to be competitive with TLplan and TALplanner, two other planners based on control formulas, while using a considerably more expressive and flexible plan structure.
منابع مشابه
Multi-Agent Planning with Planning Graph
In this paper, we consider planning for multi-agents situations in STRIPS-like domains with planning graph. Three possible relationships between agents’ goals are considered in order to evaluate plans: the agents may be collaborative, adversarial or indifferent entities. We propose algorithms to deal with each situation. The collaborative situations can be easily dealt with the original Graphpl...
متن کاملControl Strategies in Planning
Over the years increasing sophisticated planning algorithms have been developed. These have made for more efficient planners. However, current state of the art planners still suffer from severe complexity problems, problems that can surface even in domains in which good plans are easy to generate, like the blocks world. Planners generally employ search to find plans, and planning research has i...
متن کاملForward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approaches of UCPOP and VHPOP. In this paper we explore the potential of a forward-chaining state-based search strategy to support partial-order planning in the solution of temporal-numeric problems. Our planner, POPF, is buil...
متن کاملMaking Graphplan Goal-Directed
The Graphplan algorithm exemplifies the speed-up achieveable with disjunctive representations that leverage opposing directions of refinement. It is in this spirit that we introduce Bsrgraphplan, a work in progress intended to address issues of scalability and expressiveness which are problematic for Graphplan. Specifically, we want to endow the planner with intelligent backtracking and full qu...
متن کاملFLAP: Applying least-commitment in forward-chaining planning
In this paper, we present FLAP, a partial-order planner that accurately applies the least-commitment principle that governs traditional partial-order planning. FLAP fully exploits the partial ordering among actions of a plan and hence it solves more problems than other similar approaches. The search engine of FLAP uses a combination of different statebased heuristics and applies a parallel sear...
متن کامل